Loop-Carried Code Placement
نویسندگان
چکیده
Traditional code optimization techniques treat loops as nonpredictable structures and do not consider expressions containing array accesses for optimization. We show that the polyhedron model can be used to implement code placement techniques that exploit equalities of expressions that hold between loop iterations. We also present preliminary results for a simple example.
منابع مشابه
Replicated Placements in the Polyhedron Model
Loop-carried code placement (LCCP) is able to remove redundant computations that cannot be recognized by traditional code motion techniques. However, this comes possibly at the price of increased communication time. We aim at minimizing the communication time by using replicated storage.
متن کاملAdaptive fuzzy pole placement for stabilization of non-linear systems
A new approach for pole placement of nonlinear systems using state feedback and fuzzy system is proposed. We use a new online fuzzy training method to identify and to obtain a fuzzy model for the unknown nonlinear system using only the system input and output. Then, we linearized this identified model at each sampling time to have an approximate linear time varying system. In order to stabilize...
متن کاملPole placement algorithm for control of civil structures subjected to earthquake excitation
In this paper the control algorithm for controlled civil structures subjected to earthquake excitation is thoroughly investigated. The objective of this work is the control of structures by means of the pole placement algorithm, in order to improve their response against earthquake actions. Successful application of the algorithm requires judicious placement of the closed-loop eigenvalues from ...
متن کاملA Code Motion Framework for Global Instruction Scheduling
A framework for global instruction scheduling is developed that progressively improves a given instruction schedule by eliminating delay slots in the schedule one at a time through the application of global code motions. The elimination of a delay slot is carried out in two steps: a goal oriented search which identiies a global code motion or a cascade of code motions that eliminate the delay w...
متن کاملContext Optimization for SIMD Execution yKen
One issue that SIMD compilers must address is generating code to change the machine context; i.e., disabling processors not involved in the current computation. We present two compiler optimizations that reduce the cost of context changes. The rst optimization , context partitioning, reorders the Fortran 90 code so that as subgrid loops are generated, as many statements as possible that require...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001